Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(x,empty) |
→ x |
| 2: |
|
f(empty,cons(a,k)) |
→ f(cons(a,k),k) |
| 3: |
|
f(cons(a,k),y) |
→ f(y,k) |
|
There are 2 dependency pairs:
|
| 4: |
|
F(empty,cons(a,k)) |
→ F(cons(a,k),k) |
| 5: |
|
F(cons(a,k),y) |
→ F(y,k) |
|
The approximated dependency graph contains one SCC:
{4,5}.
-
Consider the SCC {4,5}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.02 seconds)
--- May 3, 2006